Solving traveling salesman problems using generalized chromosome genetic algorithm
نویسندگان
چکیده
منابع مشابه
Solving Precedence Constraint Traveling Salesman Problem using Genetic Algorithm
Traveling Salesman Problem (TSP) is an NP-hard Problem, which has so many different real life applications. Precedence Constraint TSP (PCTSP) is one specific type of TSP in which precedence is given to some cities. PCTSP also has numerous applications. Genetic Algorithms [1] are robust and probabilistic search algorithms based on the mechanics of natural selection and survival of fittest. This ...
متن کاملSolving Traveling Salesman Problems Using Molecular Programming
Molecular programming (MP) has been proposed as an evolutionary computation algorithm at the molecular level [Zhang and Shin, 1998]. MP are different from other evolutionary algorithms in its representation of solutions using DNA molecular structures and its use of bio-lab techniques for recombination of partial solutions. In this paper, molecular programming is applied to traveling salesman pr...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کاملTraveling Salesman Problem using Genetic Algorithm
Traveling Salesman Problem (TSP) is an NP-hard Problem, which has many different real life applications. Genetic Algorithms (GA) are robust and probabilistic search algorithms based on the mechanics of natural selection and survival of the fittest that is used to solve optimization and many real life problems. This paper presents Genetic Algorithm for TSP. Moreover it also shows best suitable p...
متن کاملParallel Hybrid Genetic Algorithm for Solving Traveling Salesman Problem
This paper deals with the basics of genetic algorithm, a universal method of optimization and the need for parallel genetic algorithm. This also discusses briefly on the traveling salesman problem. A methodology is proposed to solve this problem using the different
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Progress in Natural Science
سال: 2008
ISSN: 1002-0071
DOI: 10.1016/j.pnsc.2008.01.030